Multidimensional curve fitting to unorganized data points by nonlinear minimization
نویسندگان
چکیده
Many papers have addressed the problem of fitting curves to data points. However, most of the approaches are subject to a restriction that the data points must be ordered. The paper presents a method for generating a piecewise continuous parametric curve from a set of unordered and error-filled data points. The resulting curve not only provides a good fit to the original data but also possesses good fairness. Excluding the endpoints of the curve, none of the connectivity information needs to be specified, thus eliminating the necessity of an initial parameterization. The standard regularization method for univariate functions is modified for multidimensional parametric functions and results in a nonlinear minimization problem. Successive quadratic programming is applied to find the optimal solution. A physical model is also supplied to facilitate an intuitive understanding of the mathematical background.
منابع مشابه
Fitting B-Spline Curves to Point Clouds by Squared Distance Minimization
Computing a curve to approximate data points is a problem encountered frequently in many applications in computer graphics, computer vision, CAD/CAM, and image processing. We present a novel and efficient method, called squared distance minimization (SDM), for computing a planar B-spline curve, closed or open, to approximate a target shape defined by a point cloud, i.e., a set of unorganized, p...
متن کاملA Successive Minima Method for Implicit Approximation
This paper is concerned with the problem of approximating a collection of unorganized data points by an algebraic tensor-product B-spline curve. The implicit approximation to data points would be ideally based on minimizing the sum of squares of geometric distance. Since the geometric distance from a point to an implicit curve cannot be computed analytically, Sampson distance, which is the firs...
متن کاملCapturing Outlines of Planar Generic Images by Simultaneous Curve Fitting and Sub-division
In this paper, a new technique has been designed to capture the outline of 2D shapes using cubic B´ezier curves. The proposed technique avoids the traditional method of optimizing the global squared fitting error and emphasizes the local control of data points. A maximum error has been determined to preserve the absolute fitting error less than a criterion and it administers the process of curv...
متن کاملFitting Implicitly Defined Curves to Unorganized Points with Sharp Features
In order to represent and reconstruct sharp features (i.e., corners) by an implicitly defined curve, we add so–called corner detector functions, which are special radial basis functions, to the function defining the initial curve. The parameters controlling them are automatically adjusted by applying an evolution process.
متن کاملSmooth-curve Interpolation: a Generalized Spline-fit Procedure
A method is presented for finding the smoothest curve through a set of data points. "Smoothest" refers to the equilibrium, or minimum-energy configuration of an ideal elastic beam constrained to pass through the data points. The formulation of the smoothest curve is seen to involve a multivariable boundary-value minimization problem which makes use of a numerical solution of the beam nonlinear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer-Aided Design
دوره 27 شماره
صفحات -
تاریخ انتشار 1995